//Binary Search Tree
#include"BST.h"
int main()
{
	BStree<int> b;
	int arr[10] = { 8,10,2,7,3,5,4,1,6,9 };
	for (auto e : arr)
	{
		b.insert(e);
	}
	b.Inorder();
	return 0;
}